- combinatorial configuration
- мат.комбинаторная конфигурация
English-Russian scientific dictionary. 2008.
English-Russian scientific dictionary. 2008.
Configuration design — is a kind of design where a fixed set of predefined components that can be interfaced (connected) in predefined ways is given, and an assembly (i.e. designed artifact) of components selected from this fixed set is sought that satisfies a set of… … Wikipedia
Configuration entropy — In statistical mechanics, configuration entropy is the portion of a system s entropy that is related to the position of its constituent particles rather than to their velocity or momentum. It is physically related to the number of ways of… … Wikipedia
combinatorial — combinatorially, adv. /keuhm buy neuh tawr ee euhl, tohr , kom beuh /, adj. 1. of, pertaining to, or involving the combination of elements, as in phonetics or music. 2. of or pertaining to the enumeration of the number of ways of doing some… … Universalium
Fundamental theorem of combinatorial enumeration — The fundamental theorem of combinatorial enumeration is a theorem in combinatorics that solves the enumeration problem of labelled and unlabelled combinatorial classes. The unlabelled case is based on the Pólya enumeration theorem.This theorem is … Wikipedia
combinatorics — /keuhm buy neuh tawr iks, tor , kom beuh /, n. (used with singular v.) See combinatorial analysis. * * * Branch of mathematics concerned with the selection, arrangement, and combination of objects chosen from a finite set. The number of possible… … Universalium
List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… … Wikipedia
Platonic solid — In geometry, a Platonic solid is a convex polyhedron that is regular, in the sense of a regular polygon. Specifically, the faces of a Platonic solid are congruent regular polygons, with the same number of faces meeting at each vertex; thus, all… … Wikipedia
Combinatorics — is a branch of mathematics concerning the study of finite or countable discrete structures. Aspects of combinatorics include counting the structures of a given kind and size (enumerative combinatorics), deciding when certain criteria can be met,… … Wikipedia
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Fulkerson-Preis — Der Fulkerson Preis ist ein von der Mathematical Programming Society (MPS) und der American Mathematical Society (AMS) alle drei Jahre vergebener Preis für außergewöhnliche Arbeiten in diskreter Mathematik, worunter zum Beispiel Kombinatorik und… … Deutsch Wikipedia
number game — Introduction any of various puzzles and games that involve aspects of mathematics. Mathematical recreations comprise puzzles and games that vary from naive amusements to sophisticated problems, some of which have never been solved.… … Universalium